On Some Weak Extensions of AES and BES
نویسندگان
چکیده
In 2002, Murphy and Robshaw introduced an extension BES of AES and argued this could compromise the security of AES. We introduce here two block-ciphers CES and Big-BES that are some extensions of the AES and BES respectively in the spirit of Hensel lifting extensions. They are defined similarly to the AES respectively BES except that every operations are performed in a ring structure including the field GF (2). We show that the AES and BES can be embedded in their extensions. More precisely, by restricting these extensions on a given subset, we obtain a fully equivalent description of the AES and BES. Furthermore, we show that these natural extensions are trivially weak by describing a cryptanalysis of them despite it leads to no consequence about the security of AES or BES. This shows that (except the nice mathematical construction) the Murphy-Robshaw extension might be pointless.
منابع مشابه
Extensions of Some Fixed Point Theorems for Weak-Contraction Mappings in Partially Ordered Modular Metric Spaces
The purpose of this paper is to establish fixed point results for a single mapping in a partially ordered modular metric space, and to prove a common fixed point theorem for two self-maps satisfying some weak contractive inequalities.
متن کاملWeak signed Roman k-domination in graphs
Let $kge 1$ be an integer, and let $G$ be a finite and simple graph with vertex set $V(G)$.A weak signed Roman $k$-dominating function (WSRkDF) on a graph $G$ is a function$f:V(G)rightarrow{-1,1,2}$ satisfying the conditions that $sum_{xin N[v]}f(x)ge k$ for eachvertex $vin V(G)$, where $N[v]$ is the closed neighborhood of $v$. The weight of a WSRkDF $f$ is$w(f)=sum_{vin V(G)}f(v)$. The weak si...
متن کاملAn Analysis of XSL Applied to BES
Currently, the only plausible attack on the Advanced Encryption System (AES) is the XSL attack over F256 through the Big Encryption System (BES) embedding. In this paper, we give an analysis of the XSL attack when applied to BES and conclude that the complexity estimate is too optimistic. For example, the complexity of XSL on BES-128 should be at least 2 instead of the value of 2 from current l...
متن کاملLooking Inside AES and BES
We analyze an algebraic representation of AES–128 as an embedding in BES, due to Murphy and Robshaw. We present two systems of equations S and K concerning encryption and key generation processes. After some simple but rather cumbersome substitutions, we should obtain two new systems C1 and C2. C1 has 16 very dense equations of degree up to 255 in each of its 16 variables. With a single pair (p...
متن کامل